-
1 recursively structured graph
Макаров: (R-graph) рекурсивно структурированный графУниверсальный англо-русский словарь > recursively structured graph
-
2 recursively structured graph
English-Russian electronics dictionary > recursively structured graph
-
3 recursively structured graph
The New English-Russian Dictionary of Radio-electronics > recursively structured graph
-
4 recursively structured graph (R-graph)
Макаров: рекурсивно структурированный графУниверсальный англо-русский словарь > recursively structured graph (R-graph)
-
5 R-graph (recursively structured graph)
Макаров: рекурсивно структурированный графУниверсальный англо-русский словарь > R-graph (recursively structured graph)
-
6 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт моносимвольная графема, граф•- graph of strictly partial order
- acyclic graph
- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- linked pie-column graph
- line-symmetric graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed graph
- mixed column/line graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- R-graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclically closed graph
- strongly cyclic edge connected graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graph -
7 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт. моносимвольная графема, граф•- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- graph of contiguous channels
- graph of strictly partial order
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- line-symmetric graph
- linked pie-column graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed column/line graph
- mixed graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- R-graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclic edge connected graph
- strongly cyclically closed graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graphThe New English-Russian Dictionary of Radio-electronics > graph
-
8 R-graph
Макаров: (recursively structured graph) рекурсивно структурированный граф -
9 R-graph
-
10 R-graph
The New English-Russian Dictionary of Radio-electronics > R-graph
-
11 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem
См. также в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Parity of zero — Zero objects, divided into two equal groups Zero is an even number. In other words, its parity the quality of an integer being even or odd is even. Zero fits the definition of even number : it is an integer multiple of 2, namely 0 × 2. As a… … Wikipedia
Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… … Wikipedia
Dijkstra–Scholten algorithm — The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia
Dijkstra-Scholten algorithm — The Dijkstra Scholten algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.First, let us consider the case of a simple process graph which is a tree. A… … Wikipedia
Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… … Wikipedia